A rateless coding scheme transmits incrementally more and more coded bitsover an unknown channel until all the information bits are decoded reliably bythe receiver. We propose a new rateless coding scheme based on polar codes, andwe show that this scheme is capacity-achieving, i.e. its information rate is asgood as the best code specifically designed for the unknown channel. Previousrateless coding schemes are designed for specific classes of channels such asAWGN channels, binary erasure channels, etc. but the proposed rateless codingscheme is capacity-achieving for broad classes of channels as long as they areordered via degradation. Moreover, it inherits the conceptual and computationalsimplicity of polar codes.
展开▼
